Order-Sorted Unification with Regular Expression Sorts
نویسندگان
چکیده
We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is finite. The corresponding unification problem is infinitary. We conjecture that this unification problem is decidable and give a complete unification procedure.
منابع مشابه
Regular expression order-sorted unification and matching
We extend order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The obtained signature corresponds to a finite bottom-up unranked tree automaton. We prove that regular expression order-sorted (REOS) unification is of type infinitary and decidable. The unification problem presented by us generalizes some known problems, such as, e.g...
متن کاملMatching of Order-Sorted Terms with Regular Expression Sorts and Second-Order Variables
We construct a sound and complete matching procedure for order-sorted terms with regular expression sorts and second-order variables. Since the theory is infinitary, there are matching problems on which the procedure does not terminate. Restricting the rules of the procedure, we obtain an incomplete terminating algorithm and give some examples of its possible applications in source code searching.
متن کاملExtending the Resolution Method with Sorts
In this paper I extend the standard first-order resolution method with special reasoning mechanisms for sorts. Sorts are unary predicates. Literals built from unary predicates are called sort literals. Negative sort literals can be compiled into restrictions of the relevant variables to sorts or can be deleted if they fulfill special conditions. Positive sort literals define the sort-theory. So...
متن کاملUnification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading
The introduction of sorts in rst-order automatic theorem proving has been accompanied by a considerable gain in computational eeciency via reduced search spaces. This suggests that sort information can be employed in higher-order theorem proving with similar results. This paper develops an order-sorted higher-order calculus suitable for automatic theorem proving applications | by extending the ...
متن کاملUnification of Sorts Among Local Ontologies for Semantic Web Applications
Even a single domain can contain a tremendous number of local ontologies with semantic heterogeneity, thus one of the basic problems in the development of techniques for the semantic web is the integration of ontologies. This paper deals with the problem of unification among sorts for the sake of ontology integration and coherent information retrieval in semantic web applications. In this conte...
متن کامل